Object grammars and random generation
نویسندگان
چکیده
This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize contextfree grammars. The application of particular valuations to these grammars leads to enumeration and random generation of objects according to non algebraic parameters.
منابع مشابه
Uniform Random Generation of Graphs with Graph Grammars
The aim of the project is to develop a graph generator that provides users with a powerful method to specify graph classes from which the generated graphs are drawn. This is achieved by adapting a method for string generation over context-free grammars to hyperedge replacement grammars, and implementing this method in Scala.
متن کاملGeneralized Random Context Picture Grammars: The State of the Art
We present a summary of results on random context picture grammars (rcpgs), which are a method of syntactic picture generation. The productions of such a grammar are context-free, but their application is regulated—permitted or forbidden—by context randomly distributed in the developing picture. Thus far we have investigated three important subclasses of rcpgs, namely random permitting context ...
متن کاملRandom context tree grammars and tree transducers
Regular tree grammars and top-down tree transducers are extended by random context sensitivity as known from the areas of string and picture generation. First results regarding the generative power of the resulting devices are presented. In particular, we investigate the path languages of random context tree languages. Copyright c © 2005 UMINF 05.02 ISSN 0348-0542
متن کاملRule-weighted and terminal-weighted context-free grammars have identical expressivity
Two formalisms have recently been proposed to perform a nonuniform random generation of combinatorial objects based on context-free grammars. The former, introduced by Denise et al, associates weights with letters, while the latter, recently explored by Weinberg et al in the context of random generation, associates weights to transitions. In this short note, we use a trivial modification of the...
متن کاملAttribute Grammars and Automatic Complexity Analysis Attribute Grammars and Automatic Complexity Analysis Attribute Grammars and Automatic Complexity Analysis
Decomposable combinatorial structures have been well studied and a systematic manner for determining generating function equations is well known. Attribute grammars have enhanced the study of context-free grammars by giving meaning to constructions. Delest and F edou 2] showed that attribute grammars extend to combinatorial structures, with applications to random generation. In a similar way, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 2 شماره
صفحات -
تاریخ انتشار 1998